منابع مشابه
Practical and Profitable Alternatives to Greedy, Single-path Scheduling
Compiler writers continue to search for ways to use the ever-increasing number of parallel functional units in modern microarchitectures. The most popular approach today is to build a tracebased instruction scheduler, since they are effective and can be conceptually simple to implement. DAG-based schedulers that look along multiple control paths, instead of along just one as in a trace-based sc...
متن کاملGeneralized Greedy Algorithm for Shortest Superstring
In the primitive greedy algorithm for shortest superstring, if a pair of strings with maximum overlap picked out, they are subsequently merged. In this paper, we introduce the concept of optimal set and generalize the primitive greedy algorithm. The generalized algorithm can be reduced to the primitive greedy algorithm if the relative optimal set is empty. Consequently, the new algorithm achiev...
متن کاملGreedy Learning of Generalized Low-Rank Models
Learning of low-rank matrices is fundamental to many machine learning applications. A state-ofthe-art algorithm is the rank-one matrix pursuit (R1MP). However, it can only be used in matrix completion problems with the square loss. In this paper, we develop a more flexible greedy algorithm for generalized low-rank models whose optimization objective can be smooth or nonsmooth, general convex or...
متن کاملOn Generalized Greedy Algorithms in Broadcast Key Distribution Schemes
In [1] a key distribution scheme for broadcast encryption based on 2-designs was proposed. The connectivity of this scheme is the maximal number of messages which should be broadcasted by the center to the non-compromised users to generate a common key. This value was upper bounded in [1] with the use of the greedy algorithm. Unfortunately it is a very crude bound. We propose the generalized gr...
متن کاملA class of greedy algorithms for the generalized assignment problem
The Generalized Assignment Problem (GAP) is the problem of finding the minimal cost assignment of jobs to machines such that each job is assigned to exactly one machine, subject to capacity restrictions on the machines. We propose a class of greedy algorithms for the GAP. A family of weight functions is defined to measure a pseudo-cost of assigning a job to a machine. This weight function in tu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied and Computational Harmonic Analysis
سال: 2020
ISSN: 1063-5203
DOI: 10.1016/j.acha.2018.10.005